A Feasible Solution for Rebalancing Large-Scale Bike Sharing Systems

City bikes and bike-sharing systems (BSSs) are one solution to the last mile problem. BSSs guarantee equity by presenting affordable alternative transportation means for low-income households. These feature a multitude of bike stations scattered around city. Numerous mean users can borrow from location return it there or different location. However, this may create an unbalanced system, where some have excess others limited bikes. In paper, we propose balance BSS satisfy expected demand. Moreover, paper represents direct extension deferred acceptance algorithm-based heuristic previously proposed authors. We develop algorithm that provides delivery truck with near-optimal route (i.e., finding shortest Hamiltonian cycle) as NP-hard Results provide good quality computational time performance, making viable candidate real-time use operators. Our suggested approach is best suited low-Q problems. running times largest instance 143.6, 130.32, 51.85 s Q = 30, 20, 10, respectively, which makes rebalancing algorithm.